Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound
نویسنده
چکیده
In this first part, a computable outer bound is proved for the multiterminal source coding problem, for a setup with two encoders, discrete memoryless sources, and bounded distortion measures.
منابع مشابه
A Note on Cooperative Multiterminal Source Coding
We consider the multiterminal source coding problem with partially cooperating encoders. In the lossless case, we give a simple proof for a coding theorem that extends the result of Slepian and Wolf for non-cooperating encoders, resulting in a complete characterization of the rate region under this scenario. Then we extend this setup to consider an arbitrary pair of distortions (D1, D2), where ...
متن کاملMultiterminal Source Coding with High Resolution
We consider separate encoding and joint decoding of correlated continuous information sources, subject to a difference distortion measure. We first derive a multiterminal extension of the Shannon lower bound for the rate region. Then we show that this Shannon outer bound is asymptotically tight for small distortions. These results imply that the loss in the sum of the coding rates due to the se...
متن کاملRobust Distributed Source Coding with Arbitrary Number of Encoders and Practical Code Design Technique
The robustness property can be added to DSC system at the expense of reducing performance, i.e., increasing the sum-rate. The aim of designing robust DSC schemes is to trade off between system robustness and compression efficiency. In this paper, after deriving an inner bound on the rate–distortion region for the quadratic Gaussian MDC based RDSC system with two encoders, the structure of...
متن کاملAn Infeasibility Result for the Multiterminal Source-Coding Problem
We prove a new outer bound on the rate-distortion region for the multiterminal source-coding problem. This bound subsumes the best outer bound in the literature and improves upon it strictly in some cases. The improved bound enables us to obtain a new, conclusive result for the binary erasure version of the “CEO problem.” The bound recovers many of the converse results that have been establishe...
متن کاملThe Region of Achievable Rates for Multiterminal Source Coding–Part I
It is proved that a convexified form of the Berger-Tung inner bound provides the set of all achievable rates for the multiterminal source coding problem. In this paper, a proof is developed for general discrete memoryless sources and bounded distortion measures, for two encoding terminals. The proof is based on two new developments. One is the construction of new inner and outer bounds to the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0604005 شماره
صفحات -
تاریخ انتشار 2006